Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage
نویسندگان
چکیده
AbstractIn current blockchain systems, full nodes that perform all of the available functionalities need to store entire blockchain. In addition blockchain, also a blockchain-summary, called state, which is used efficiently verify transactions. With size popular blockchains and their states growing rapidly, require massive storage resources in order keep up with scaling. This leads tug-of-war between scaling decentralization since fewer entities can afford expensive resources. We present hybrid for proof-of-work (PoW) cryptocurrencies validate transactions, blocks, states, mine, select main chain, bootstrap new nodes, payment proofs. use protocol trimming, only retain polylogarithmic number blocks chain length represent Hybrid are optimized state stateless protocols. The lowered requirements should enable more join as improve system. define novel theoretical security models show they provably secure. requirement near-optimal respect our definitions.KeywordsBlockchainsCryptocurrencyStorageNIPoPoWHybrid nodesTrimming
منابع مشابه
All Complete Functionalities are Reversible
Crépeau and Santha, in 1991, posed the question of reversibility of functionalities, that is, which functionalities when used in one direction, could securely implement the identical functionality in the reverse direction. Wolf and Wullschleger, in 2006, showed that oblivious transfer is reversible. We study the problem of reversibility among 2-party SFE functionalities, which also enable gener...
متن کاملMetadisk: Blockchain-Based Decentralized File Storage Application
Metadisk is an open source software project seeking to prove conceptually that cloud storage applications can be made more decentralized, more secure, and more efficient. In addition, Metadisk provides a prototyping platform for a fully decentralized network. In pursuit of this goal, we propose developing a web application that provides an interface for non-technical users, and an underlying AP...
متن کاملAchieving All with No Parameters: AdaNormalHedge
We study the classic online learning problem of predicting with expert advice, and propose a truly parameter-free and adaptive algorithm that achieves several objectives simultaneously without using any prior information. The main component of this work is an improved version of the NormalHedge.DT algorithm (Luo and Schapire, 2014), called AdaNormalHedge. On one hand, this new algorithm ensures...
متن کاملAchieving All with No Parameters: Adaptive NormalHedge
We study the classic online learning problem of predicting with expert advice, and propose a truly parameter-free and adaptive algorithm that achieves several objectives simultaneously without using any prior information. The main component of this work is an improved version of the NormalHedge.DT algorithm [Luo and Schapire, 2014], called AdaNormalHedge. On one hand, this new algorithm ensures...
متن کاملAchieving fairness in multicasting with almost stateless rate control
Several flow control algorithms have been proposed for attaining maxmin fair rates. All of these strategies use flow specific states at all nodes in the network, and are hence unsuitable for deployment in the current internet. We propose a new approach which attains maxmin fairness in unicast networks while maintaining per flow states at the edge nodes only. Next, we consider multirate, multica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-18283-9_32